public class code1 {
    //双指针+贪心（i跳跃）
    public int findLengthOfLCIS(int[] nums) {
        int n = nums.length;
        int ret = 1;
        for(int i=0;i<n;i++) {
            int k = 1;
            for(int j=i;j<n-1;j++) {
                if(nums[j+1]>nums[j]) {
                    k++;
                }else {
                    i = j;
                    break;
                }
            }
            ret = Math.max(k,ret);
        }
        return ret;
    }
}
